/*
 * Problem:
 * Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.
 * 实现一个算法来删除一棵单链表中的结点(既非表头，也非表尾)，假设只能唯一地访问到此结点。
 * 
 * Example:
 * Linked list is 1->2->3->4, and given node 3, delete the node in place 1->2->4
 * 链表是1->2->3->4，给定结点3，删除该结点，得到1->2->4
 * 
 */
package me.yobol.lintcode.easy.deletenode;

import me.yobol.lintcode.ListNode;

/**
 *
 * @author Yobol
 */
public interface IDeleteNode {
    public void deleteNode(ListNode node);
}
